An Optimal Victim Selection Algorithm for Removing Global Deadlocks in Multidatabase Systems

A time-out mechanism based on a potential conpici graph has been ap lied i o deiect global deadlocks. In order i o perform t i e time-out mechanism betier, in this paper we propose an optimal vidim selection algorithm for resolving global deadlocks in a muliidaiabase system. The algorithm selects a set of iransaciions urirh the minimal abortion cost to resolve global deadlocks. It makes the use of network pow techniques, and run8 in lime O(ns), where n is the sixe of a subset of ihe global transactions.